On cyclic DNA codes over the Ring $\Z_4 + u \Z_4$
نویسندگان
چکیده
In this paper, we study the theory for constructing DNA cyclic codes of odd length over Z4[u]/〈u 2〉 which play an important role in DNA computing. Cyclic codes of odd length over Z4+uZ4 satisfy the reverse constraint and the reverse-complement constraint are studied in this paper. The structure and existence of such codes are also studied. The paper concludes with some DNA example obtained via the family of cyclic codes.
منابع مشابه
A class of cyclic Codes Over the Ring $\Z_4[u]/<u^2>$ and its Gray image
Cyclic codes over R have been introduced recently. In this paper, we study the cyclic codes over R and their Z2 image. Making use of algebraic structure, we find the some good Z2 codes of length 28.
متن کاملConstruction of cyclic DNA codes over the Ring $\Z_4[u]/\langle u^2-1 \rangle $ Based on the deletion distance
In this paper, we develop the theory for constructing DNA cyclic codes of odd length over R = Z4[u]/〈u 2 − 1〉 based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring R. Cyclic codes of odd length over R satisfy the reverse constraint and the reverse-complement constraint are discussed in this paper. We also study the GC-content of these codes and their de...
متن کاملZ2Z4-linear codes: generator matrices and duality
A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z...
متن کاملTrace codes over $\Z_4$ and Boolean function
We construct trace codes over Z4 by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new family of optimal two-weight codes over Z4.
متن کاملZ4-linear Hadamard and extended perfect codes
If $N=2^k>8$ then there exist exactly $[(k-1)/2]$ pairwise nonequivalent $Z_4$-linear Hadamard $(N,2N,N/2)$-codes and $[(k+1)/2]$ pairwise nonequivalent $Z_4$-linear extended perfect $(N,2^N/2N,4)$-codes. A recurrent construction of $Z_4$-linear Hadamard codes is given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1508.02015 شماره
صفحات -
تاریخ انتشار 2015